- primality test(ing)
- проверка (тестирование) на принадлежность к классу пpостых чисел (на простоту)
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
primality test(ing)
Смотреть что такое "primality test(ing)" в других словарях:
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Vaughan Pratt — Vaughan Ronald Pratt (born 1944), a Professor Emeritus at Stanford University, was one of the earliest pioneers in the field of computer science. Publishing since 1969, Pratt has made innumerable contributions to foundational areas such as search … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Paul Leyland — is a number theorist who has studied integer factorization and primality testing.He has contributed to the factorization of RSA 129, RSA 140, and RSA 155, as well as potential factorial primes as large as 400! + 1. He has also studied Cunningham… … Wikipedia
Twin Prime Search — (TPS) is a distributed computing project that looks for large twin primes. It uses the programs LLR (for primality testing) and NewPGen (for sieving). It was founded on April 13 2006 by Michael Kwok. TPS has found one twin prime, 2003663613… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
